//use limit_rs;

//use limit_rs::algorithms;

//use algorithms::binary_search::rank;
//use algorithms::sorts::bubble_sort;
//use std::collections::HashMap;

use limit_rs::leetcode::vec::merge_sorted_array::merge2;

fn main() {
  // let mut list: Vec<i32> = vec![3, 55, 44, 8, 99];
  //    let mut will_search: Vec<i32> = vec![1, 2, 3, 55, 44, 88, 99];
  //    bubble_sort(&mut list);
  //    bubble_sort(&mut will_search);
  //    let mut _tmp: Vec<i32> = will_search.into_iter()
  //        .filter(|key| rank(*key, &list) < 0)
  //        .collect();
  //    list.append(&mut _tmp);
  //    for i in list.into_iter() {
  //        println!("{}", i)
  //    }
  // let mut a: Vec<i32> = vec![1, 2, 3, 0, 0, 0];
  let mut a: Vec<i32> = vec![1];
  let mut b: Vec<i32> = vec![];
  merge2(&mut a, 1, &mut b, 0);
}

/*
fn fib(n: i32) -> i32 {
    match n {
        1 | 2 => 1,
        n => fib(n - 1) + fib(n - 2)
    }
}

fn autocomplete(history: Vec<String>, text_entered: &str) -> Vec<String> {
    use std::hash::Hash;
    history
        .into_iter()
        .filter(|x| text_entered.starts_with(x.as_str()))
        .collect()
}
*/
